"Dual Graph" and "Random Chemistry" Methods for Cascading Failure Analysis
نویسندگان
چکیده
This paper describes two new approaches to cascading failure analysis in power systems that can combine large amounts of data about cascading blackouts to produce information about the ways that cascades may propagate. In the first, we evaluate methods for representing cascading failure information in the form of a graph. We refer to these graphs as “dual graphs” because the vertices are the transmission lines (the physical links), rather than the more conventional approach of representing power system buses as vertices. Examples of these ideas using the IEEE 30 bus system indicate that the “dual graph” methods can provide useful insight into how cascades propagate. In the second part of the paper we describe a random chemistry algorithm that can search through the enormous space of possible combinations of potential component outages to efficiently find large collections of the most dangerous combinations. This method was applied to a power grid with 2896 transmission branches, and provides insight into component outages that are notably more likely than others to trigger a cascading failure. In the conclusions we discuss potential uses of these methods for power systems planning and operations.
منابع مشابه
Load-based cascading failure analysis in finite Erdös-Rényi random networks
Large-scale cascading failures could be triggered by very few initial failures, which lead to serious damages in complex networks. This paper presents a load-based cascade model to analyze the vulnerability of a complex system such as the power grid under a random single-node attack, where the Erdös-Rényi (ER) random graph is used as the network model since it captures the exponential degree di...
متن کاملPercolation Processes and Wireless Network Resilience to Degree-Dependent and Cascading Node Failures
We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of neighbors). We model this phenomenon as a degree-dependent site percolation process on random geometric graphs. Due to its non-Poisson structure, degree-dependent si...
متن کاملEvaluating the potential of cascading failure occurrence due to line outage in power systems by information theory method and radial base functions
In power systems, a connected topology is created to increase reliability and economic performance. Increasing dimensions of power systems on the one hand and the need to continuously monitor power systems for secure operation on the other challenge the evaluation of power system security. In such conditions, due to economic conditions and considering the fast growth of consumers in a power sys...
متن کاملA “Random Chemistry” Algorithm for Identifying Multiple Contingencies that Initiate Cascading Failure
This paper describes a stochastic “Random Chemistry” (RC) algorithm to identify multiple (n− k) contingencies that initiate large cascading failures in a simulated power system. The method requires only O(log(n)) simulations per contingency identified, which is orders of magnitude faster than random search of this combinatorial space. We applied the method to a model of cascading failure in a p...
متن کاملCascading Failures in Finite-Size Random Geometric Networks
The problem of cascading failures in cyber-physical systems is drawing much attention in lieu of different network models for a diverse range of applications. While many analytic results have been reported for the case of large networks, very few of them are readily applicable to finite-size networks. This paper studies cascading failures in finite-size geometric networks where the number of no...
متن کامل